Hotspot-entropy based data forwarding in opportunistic social networks

نویسندگان

  • Peiyan Yuan
  • Huadong Ma
  • Huiyuan Fu
چکیده

Performance of data forwarding in opportunistic social networks benefits considerably if one canmake use of humanmobility in terms of social contexts. However, it is difficult and time-consuming to calculate the centrality and similarity of nodes by using solutions of traditional social networks analysis, this is mainly because of the transient node contact and the intermittently connected link. In this paper, we are interested in the following question: Can we exploit some other stable social attributes to quantify the centrality and similarity of nodes? Aggregating GPS traces of human walks from the real world, we find that there exist two types of phenomena. One is public hotspot, the other is personal hotspot. Motivated by this observation, we propose Hotent (HOTspot-ENTropy), a novel data forwarding metric to improve the performance of opportunistic routing. First, we use the relative entropy between the public hotspots and the personal hotspots to compute node centrality. Second, we utilize the inverse symmetrized entropy of the personal hotspots between two nodes to evaluate their similarity. Third, we integrate the two social metrics by using the law of universal gravitation. Besides, we use the entropy of personal hotspots of a node to characterize its personality. Finally, we compare our routing strategy with the state-of-the-art works through extensive trace-driven simulations, the results show that Hotent largely outperforms other solutions, especially in terms of packet delivery ratio and the average number of hops per message. © 2014 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Exploiting Hotspot and Entropy for Data Forwarding in Delay Tolerant Networks

Performance of data forwarding in Delay Tolerant Networks (DTNs) benefits considerably if one can make use of human mobility in terms of social structures. However, it is difficult and time-consuming to calculate the centrality and similarity of nodes by using solutions for traditional social networks, this is mainly because of the transient node contact and the intermittently connected environ...

متن کامل

Hotspot: Location-based Forwarding Scheme in an Opportunistic Network

In an opportunistic network (OPPNET), the forwarding schemes for adhoc networks are not applicable since there is no complete path between the source and the destination node and relay nodes should store messages when no forwarding opportunity exists. Recently several proper schemes have been proposed in an OPPNET. Among them, floodingbased schemes result in very high network traffic and low tr...

متن کامل

TCP adaptation with network coding and opportunistic data forwarding in multi-hop wireless networks

Opportunistic data forwarding significantly increases the throughput in multi-hop wireless mesh networks by utilizing the broadcast nature of wireless transmissions and the fluctuation of link qualities. Network coding strengthens the robustness of data transmissions over unreliable wireless links. However, opportunistic data forwarding and network coding are rarely incorporated with TCP becaus...

متن کامل

Design an Efficient Community-based Message Forwarding Method in Mobile Social Networks

Mobile social networks (MSNs) are a special type of Delay tolerant networks (DTNs) in which mobile devices communicate opportunistically to each other. One of the most challenging issues in Mobile Social Networks (MSNs) is to design an efficient message forwarding scheme that has a high performance in terms of delivery ratio, latency and communication cost. There are two different approaches fo...

متن کامل

Opportunistic Forwarding with Partial Centrality

In opportunistic networks, the use of social metrics (e.g., degree, closeness and betweenness centrality) of human mobility network, has recently been shown to be an effective solution to improve the performance of opportunistic forwarding algorithms. Most of the current social-based forwarding schemes exploit some globally defined node centrality, resulting in a bias towards the most popular n...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Pervasive and Mobile Computing

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2015